Completeness and Decidability Results for CTL in Constructive Type Theory Christian Doczkal Gert Smolka

Source URL: www.ps.uni-saarland.de

Denotational semantics for lazy initialization of letrec black holes as exceptions rather than divergence Keiko Nakata Institute of Cybernetics at Tallinn University of Technology Abstract We present a denotational seman

Source URL: www.cs.ioc.ee

• Theoretical computer science
• Models of computation
• Mathematical logic
• Software engineering
• Computability theory
• Denotational semantics
• Logic in computer science
• Lambda calculus
• Substitution
• Function type

Value Sensitivity and Observable Abstract Values for Information Flow Control Luciano Bello1 , Daniel Hedin1,2 , and Andrei Sabelfeld1 1 Chalmers University of Technology

Source URL: www.cse.chalmers.se

• Data types
• Type theory
• Typeof
• Variable
• High Speed 2
• Information flow
• Dynamical system
• Monad
• Type system
• Operator

The Habit Programming Language: The Revised Preliminary Report The High Assurance Systems Programming Project (Hasp) Department of Computer Science, Portland State University Portland, Oregon 97207, USA November 2010

Source URL: hasp.cs.pdx.edu

• Functional languages
• Functional programming
• Data types
• Type theory
• Procedural programming languages
• Haskell
• Syntax
• Monad
• Type system
• ML
• Programming language
• Type class

CTP-based programming languages ? Considerations about an experimental design Florian Haftmann Cezary Kaliszyk

Source URL: dream.inf.ed.ac.uk

• Theoretical computer science
• Automated theorem proving
• Logic in computer science
• Proof assistants
• Formal methods
• Isabelle
• Type theory
• HOL
• Automated reasoning
• Computer algebra system
• Vienna Development Method
• Software development

COMP 520 FallType checking (1) COMP 520 Fall 2007

Source URL: www.sable.mcgill.ca

• Type theory
• Symbol
• Type system
• Mathematical logic
• Logic in computer science
• Theoretical computer science
• Automated theorem proving
• Logic programming

Andrew M. Kent Contact Information Lindley Hall 215 Indiana University

Source URL: andmkent.com

• Software engineering
• Programming language theory
• Computing
• Procedural programming languages
• Functional languages
• Gradual typing
• Type system
• Programming language
• Racket
• ALGOL 68
• Io
• Association for Computing Machinery

OpenDreamKit Work Package 6 The Knowledge-First Strategy for System Integration

Source URL: opendreamkit.org

• Software
• Computing
• Application software
• Semantic Web
• Markup languages
• Mathematical markup languages
• Michael Kohlhase
• OMDoc
• SageMath
• Type theory

GADTs and exhaustiveness: looking for the impossible Jacques Garrigue Nagoya University

Source URL: www.math.nagoya-u.ac.jp

• Software engineering
• Computer programming
• Computing
• Functional languages
• Data types
• Procedural programming languages
• Functional programming
• Type theory
• Generalized algebraic data type
• OCaml
• ML
• Caml

Tracing ambiguity in GADT type inference Jacques Garrigue∗ Didier R´emy† Abstract

Source URL: www.math.nagoya-u.ac.jp

• Type theory
• Data types
• Functional languages
• Type systems
• Object-oriented programming languages
• OCaml
• Type inference
• Generalized algebraic data type
• Unification
• ML
• HindleyMilner type system
• Type conversion